High Rate Binary Coset Code Used for Inner Code
نویسندگان
چکیده
High rate binary coset codes are investigated. The binary coset(BC) code is a binary convolutional code with parallel path. In our previous research of concatenated trelliscoded modulation(TCM) scheme, we have found that the e ective minimum distance of inner code is more important than the minimum free distance when TCM is used as inner code. In this paper, for inner code, we construct the high rate BC codes by maximizing the e ective minimum distance. With the new inner codes, we can decrease the decoding complexity of the inner code compared with conventional best convolutional code while maintaining the overall decoding performance. key words:
منابع مشابه
Inner Code Rate Selection for a Concatenated Coding
| Concatenated codes have long been used as a practical means of combating errors on very noisy channels. In this paper we investigate the performance of concatenated systems that employ inner convolutional codes with outer Reed-Solomon codes. We determine upper and lower bounds of the optimal inner code rate for a selected overall code rate on a binary symmetric channel .
متن کاملComputing coset leaders and leader codewords of binary codes
Communicated by [editor] In this paper we use the Gröbner representation of a binary linear code C to give efficient algorithms for computing the whole set of coset leaders, denoted by CL(C) and the set of leader codewords, denoted by L(C). The first algorithm could be adapted to provide not only the Newton and the covering radius of C but also to determine the coset leader weight distribution....
متن کاملComputing coset leaders of binary codes
We present an algorithm for computing the set of all coset leaders of a binary code C ⊂ F n 2. The method is adapted from some of the techniques related to the computation of Gröbner representations associated with codes. The algorithm provides a Gröbner representation of the binary code and the set of coset leaders CL(C). Its efficiency stands of the fact that its complexity is linear on the n...
متن کاملTypicality of the Linear Code among the LDPC Coset Code Ensemble
Density evolution (DE) is one of the most powerful analytical tools for low-density parity-check (LDPC) codes on memoryless binary-input/symmetric-output channels. The case of non-symmetric channels is tackled either by the LDPC coset code ensemble (a channel symmetrizing argument) or by the generalized DE for linear codes on non-symmetric channels. Existing simulations show that the performanc...
متن کاملOn the Pless Construction and ML Decoding of the Quadratic Residue Code
We present a method for maximumlikelihood decoding of the quadratic residue code This method is based on projecting the code onto a subcode with an acyclic Tanner graph and representing the set of coset leaders by a trellis diagram This results in a two level coset decoding which can be considered a systematic generalization of the Wagner rule We show that unlike the Golay code the code does no...
متن کامل